Are non‐lethal weapons a viable military option to strengthen the hearts and minds approach in Afghanistan?

Commanders of the International Security Assistance Force (ISAF) have repeatedly stressed the hearts and minds approach in Afghanistan, in saying that the human terrain is decisive for a successful outcome of the mission. Avoidance of civilian casualties is considered of strategic importance, and by nature highly dependent on the management of tactical level Escalation of Force (EoF) situations. Non‐lethal weapons (NLWs) are expected to enable tactical commanders to avoid innocent civilian casualties in such situations. This article considers a selected NLW on its potential to accomplish this requirement. It uses a defence technology assessment approach to analyse EoF situations experienced by Dutch ISAF forces in which the NLW is inserted. The analysis demonstrates that a range of contextual factors in the Afghanistan high‐risk environment tend to narrow down the window of opportunity for the NLW to help defuse the risk of unintended civil casualties.     

基于回合制对抗推演的探索性仿真实验兵力行动序列生成

信息时代的战役、战斗越来越呈现出复杂系统的特性,而探索性仿真实验正是一种研究复杂系统的有效手段。为向探索性仿真实验提供符合人类决策过程的兵力行动序列,基于人机结合的思想,采用回合制对抗推演方法来生成决策序列并加以优化,并对决策向兵力行动转化的模型进行分析,将决策序列转化为兵力行动序列,为后续仿真实验提供了仿真输入。研究成果对军事专家如何参与探索性仿真实验具有一定的借鉴意义。     

一种改进方位向非线性CS大斜视角SAR成像算法

大斜视角SAR成像时存在严重的距离走动现象,慢时域的距离走动校正在解决这一问题同时导致了聚焦深度问题.分析了二维频域解耦合后残余相位误差以及时域走动校正后的多普勒调频率误差,提出一种改进的方位向非线性CS算法,校正了三次以上距离迁徙带来的相位误差,同时采用改进非线性CS扰动方程补偿了随方位偏移量线性变化的调频率误差.仿真结果表明,改进算法的大斜视角大场景成像性能优于传统的高分辨大斜视角成像算法.     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Dynamic capacity reservation and due date quoting in a make‐to‐order system

We consider a make‐to‐order manufacturer facing random demand from two classes of customers. We develop an integrated model for reserving capacity in anticipation of future order arrivals from high priority customers and setting due dates for incoming orders. Our research exhibits two distinct features: (1) we explicitly model the manufacturer's uncertainty about the customers' due date preferences for future orders; and (2) we utilize a service level measure for reserving capacity rather than estimating short and long term implications of due date quoting with a penalty cost function. We identify an interesting effect (“t‐pooling”) that arises when the (partial) knowledge of customer due date preferences is utilized in making capacity reservation and order allocation decisions. We characterize the relationship between the customer due date preferences and the required reservation quantities and show that not considering the t‐pooling effect (as done in traditional capacity and inventory rationing literature) leads to excessive capacity reservations. Numerical analyses are conducted to investigate the behavior and performance of our capacity reservation and due date quoting approach in a dynamic setting with multiple planning horizons and roll‐overs. One interesting and seemingly counterintuitive finding of our analyses is that under certain conditions reserving capacity for high priority customers not only improves high priority fulfillment, but also increases the overall system fill rate. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

以“贴近纳新”理念改进 任职教育军事专业课教法的几点思考

深化以任职教育为主体的教学方法改革，是顺应当前武警部队职能任务多样化的必然要求。任职教育适应岗位任职能力的需要必须注重加强军事专业课教学方法的改革与探索。“贴近纳新”把贴近职能需要纳入教学理念、贴近任职实际纳入组教模式、贴近岗位实用纳入课题施教为着眼点，旨在适应任职教育岗位任职能力培养的需要。     

新疆兵团中小学双语教育质量调查及对策研究--以兵团第三师为例

双语教育质量是兵团民族教育的关键，直接影响高素质少数民族人才的培养。本文在深入调查的基础上，研究兵团中小学双语教育质量及其现状，通过对影响双语教育质量的各个因素进行分析，总结双语教育中存在的问题，并在此基础上提出加强校本培训和师资队伍建设，完善双语教材及考核评价体系等对策。     

大学英语分级教学模式下的学习策略培养

大学英语分级教学模式下对学生的学习策略培养非常重要。教师在整个教学过程当中,要研究和掌握学生的语言学习习得过程,研究其学习特点,认知风格,心理特征,加强对学生学习策略的培养和指导,帮助学生积极参与、探索、建构和使用学习策略,为学生掌握学习策略提供条件与平台,使学生自觉运用学习策略自我管理、自我调控、自我评估学习过程和学习效果,不断提高自主学习的能力。     

基于垂直线列阵的深海被动目标定深误差

首先研究了在深海环境下,采用三阵元垂直线列阵水声探测系统进行被动目标定深的基本原理。然后分别从随机误差、阵元配置偏差和相干多途水声信道干扰的角度,对被动目标定深的误差源进行了理论分析,并推导了相关公式。通过仿真实验,总结出各误差源对被动目标定深精度影响的规律,为进一步开展被动目标定深研究、提高被动目标定深精度奠定了基础。     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017